Cycles in squares of trees without generalized claws
نویسندگان
چکیده
منابع مشابه
Distance-regular graphs without 4-claws
We determine the distance-regular graphs with diameter at least 3 and c2 ≥ 2 but without induced K1,4-subgraphs.
متن کاملList-Coloring the Squares of Planar Graphs without 4-Cycles and 5-Cycles
Let G be a planar graph without 4-cycles and 5-cycles and with maximum degree ∆ ≥ 32. We prove that χ`(G ) ≤ ∆ + 3. For arbitrarily large maximum degree ∆, there exist planar graphs G∆ of girth 6 with χ(G 2 ∆) = ∆ + 2. Thus, our bound is within 1 of being optimal. Further, our bound comes from coloring greedily in a good order, so the bound immediately extends to online list-coloring. In additi...
متن کاملThe maximum size of hypergraphs without generalized 4-cycles
Let fr(n) be the maximum number of edges in an r-uniform hypergraph on n vertices that does not contain four edges A,B,C, D with A ∪ B = C ∪D and A ∩ B = C ∩D = ∅. This problem was stated by Erdős [Congres. Numer., 19 (1977) 3–12]. It can be viewed as a generalization of the Turán problem for the 4-cycle to hypergraphs. Let φr = lim supn→∞ fr(n)/ ( n r−1 ) . Füredi [Combinatorica, 4 (1984) 161–...
متن کاملCombinatorics of least-squares trees.
A recurring theme in the least-squares approach to phylogenetics has been the discovery of elegant combinatorial formulas for the least-squares estimates of edge lengths. These formulas have proved useful for the development of efficient algorithms, and have also been important for understanding connections among popular phylogeny algorithms. For example, the selection criterion of the neighbor...
متن کاملTransversals in generalized Latin squares
We are seeking a sufficient condition that forces a transversal in a generalized Latin square. A generalized Latin square of order n is equivalent to a proper edge-coloring of Kn,n. A transversal corresponds to a multicolored perfect matching. Akbari and Alipour defined l(n) as the least integer such that every properly edge-colored Kn,n, which contains at least l(n) different colors, admits a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2013
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.06.022